An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem
نویسندگان
چکیده
Based on a new version of Hopcroft and Tarjan’s planarity testing algorithm, we develop an O (mlogn)-time algorithm to find a maximal planar subgraph.
منابع مشابه
New algorithms for $k$-degenerate graphs
A graph is k-degenerate if any induced subgraph has a vertex of degree at most k. In this paper we prove new algorithms finding cliques and similar structures in these graphs. We design linear time Fixed-Parameter Tractable algorithms for induced and non induced bicliques. We prove an algorithm listing all maximal bicliques in time O(k(n−k)2), improving the result of [D. Eppstein, Arboricity an...
متن کاملPlanar Separators and Parallel Polygon Triangulation
We show how to construct an O p n separator decomposition of a planar graph G in O n time Such a decomposition de nes a binary tree where each node corresponds to a subgraph of G and stores an O p n separator of that subgraph We also show how to construct an O n way decomposition tree in parallel in O log n time so that each node corresponds to a subgraph of G and stores an O n separator of tha...
متن کاملDistributed Symmetry-Breaking Algorithms for Congested Cliques
The Congested Clique is a distributed-computing model for single-hop networks with restricted bandwidth that has been very intensively studied recently. It models a network by an n-vertex graph in which any pair of vertices can communicate one with another by transmitting O(log n) bits in each round. Various problems have been studied in this setting, but for some of them the best-known results...
متن کاملMinimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the sum of the n distances between matched pairs is minimized. The graph theoretic version of this problem has been extensively studied since the pioneering work of Edmonds. The best time bound known for MEWM is O(n 2:5 (...
متن کاملPlane Gossip: Approximating rumor spread in planar graphs
We study the design of schedules for multi-commodity multicast. In this problem, we are given an undirected graph G and a collection of source-destination pairs, and the goal is to schedule a minimumlength sequence of matchings that connects every source with its respective destination. Multi-commodity multicast models a classic information dissemination problem in networks where the primary co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 22 شماره
صفحات -
تاریخ انتشار 1993